Generalized hard cluster analysis
نویسندگان
چکیده
منابع مشابه
Algorithms for NP-hard Optimization Problems and Cluster Analysis
Algorithms for NP-hard Optimization Problems and Cluster Analysis by Nan Li The set cover problem, weighted set cover problem, minimum dominating set problem and minimum weighted dominating set problem are all classical NP-hard optimization problems of great importance in both theory and real applications. Since the exact algorithms, which require exhaustive exploration of exponentially many op...
متن کاملGeneralized Cluster Aggregation
Clustering aggregation has emerged as an important extension of the classical clustering problem. It refers to the situation in which a number of different (input) clusterings have been obtained for a particular data set and it is desired to aggregate those clustering results to get a better clustering solution. In this paper, we propose a unified framework to solve the clustering aggregation p...
متن کاملEigenvalue Decomposition as a Generalized Synchronization Cluster Analysis
Motivated by the recent demonstration of its use as a tool for the detection and characterization of phase-shape correlations in multivariate time series, we show that eigenvalue decomposition can also be applied to a matrix of indices of bivariate phase synchronization strength. The resulting method is able to identify clusters of synchronized oscillators, and to quantify their strength as wel...
متن کاملGeneralized counting rule for hard exclusive processes.
We derive a generalized counting rule for hard exclusive processes involving parton orbital angular momentum and hadron helicity flip. We start with a systematic way to enumerate the Fock components of a hadronic light-cone wave function with n partons and orbital angular momentum projection l(z). We show that the wave-function amplitude psi(n)(x(i),k(i perpendicular ),l(zi)) has a leading beha...
متن کاملGeneralized Hard Constraints for Graph Segmentation
Graph-based methods have become well-established tools for image segmentation. Viewing the image as a weighted graph, these methods seek to extract a graph cut that best matches the image content. Many of these methods are interactive, in that they allow a human operator to guide the segmentation process by specifying a set of hard constraints that the cut must satisfy. Typically, these constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2011
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2011.560667